The Renyi redundancy of generalized Huffman codes
نویسندگان
چکیده
منابع مشابه
The Rényi redundancy of generalized Huffman codes
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...
متن کاملRedundancy-Related Bounds on Generalized Huffman Codes
This paper presents new lower and upper bounds for the compression rate of optimal binary prefix codes on memoryless sources according to various nonlinear codeword length objectives. Like the most well-known redundancy bounds for minimum (arithmetic) average redundancy coding — Huffman coding — these are in terms of a form of entropy and/or the probability of the most probable input symbol. Th...
متن کاملOn the Redundancy Achieved by Huffman Codes
It has been recently proved that the redundancy r of any discrete memoryless source satisses r 1?H(p N), where p N is the least likely source letter probability. We prove that this bound is achieved only by sources consisting of two letters and that a sharper bound holds if the number of source letters is greater than two. Also provided is a new upper bound on r, as function of the two least li...
متن کاملBounds on Generalized Huffman Codes
New lower and upper bounds are obtained for the compression of optimal binary prefix codes according to various nonlinear codeword length objectives. Like the coding bounds for Huffman coding — which concern the traditional linear code objective of minimizing average codeword length — these are in terms of a form of entropy and the probability of the most probable input symbol. As in Huffman co...
متن کاملA simple upper bound on the redundancy of Huffman codes
Upper bounds on the redundancy of Huffman codes have been extensively studied in the literature. Almost all of these bounds are in terms of the probability of either the most likely or the least likely source symbol. In this correspondence, we prove a simple upper bound in terms of the probability of any source symbol.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1988
ISSN: 0018-9448,1557-9654
DOI: 10.1109/18.21251